Papers with training-based methods

15 papers
Towards Reliable Large Audio Language Model (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in large audio language models (LALMs) have demonstrated impressive results and promising prospects in universal understanding and reasoning across speech, music, and general sound.
Approach: They propose to use training-free and training-based methods to enhance LALM reliability to different extents.
Outcome: The proposed methods improve the reliability of large audio language models to different extents.
Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibration (2026.acl-short)

Copied to clipboard

Challenge: Existing methods for listwise reranking exhibit intrinsic position bias . existing methods are constrained by an inherent trade-off between efficiency and flexibility .
Approach: They propose a training-free framework that mechanically decouples positional bias from ranking decisions.
Outcome: a training-free framework decouples position bias from ranking decisions . evaluations show it outperforms training-based methods and outperformed expensive methods .
Self-Correcting Code Generation Using Small Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: a recent study has demonstrated that self-correction is a powerful tool for code generation, but whether it is effective for smaller models remains unexplored.
Approach: They propose a method that trains small language models to maintain correct outputs while progressively correcting incorrect outputs as turns proceed.
Outcome: The proposed approach improves the ability of small language models for multi-turn code correction.
ThinkPilot: Steering Reasoning Models via Automated Think-prefixes Optimization (2026.findings-eacl)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) are powerful but still suffer from inefficient and off-target reasoning.
Approach: They propose a training-free framework that automatically optimizes Large Reasoning Models' reasoning by generating think-prefixes that evolve driven by a taxonomy of reasoning behaviors.
Outcome: The proposed framework significantly improves accuracy-length trade-off for efficient reasoning, drastically improves safety and improves instruction following.
SSS: Editing Factual Knowledge in Language Models towards Semantic Sparse Space (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods to modify LMs suffer from sub-optimal locality, where irrelevant neighborhood examples can be adversely influenced.
Approach: They propose to use a model editing method to modify specific examples in LMs to improve locality and reasoning capability by directing the hidden state of edit example towards spaces where semantics are sparse.
Outcome: The proposed method improves locality and reasoning capability on two datasets.
Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to accelerate autoregressive generation of large language models require training costs.
Approach: They propose a training-free alignment-augmented speculative decoding algorithm . it leverages the output distribution obtained in the prefilling phase to provide more aligned draft candidates .
Outcome: The proposed method increases the average generation score by 3.3 points for the LLaMA3 model.
Diversifying Neural Text Generation with Part-of-Speech Guided Softmax and Sampling (2022.coling-1)

Copied to clipboard

Challenge: Existing methods to generate text using contextual features do not consider syntactic structure clues.
Approach: They propose using linguistic annotation, i.e., part-of-speech (POS), to guide the text generation.
Outcome: The proposed method can generate more diverse text while maintaining comparable quality.
Mind Your Neighbours: Leveraging Analogous Instances for Rhetorical Role Labeling for Legal Documents (2024.lrec-main)

Copied to clipboard

Challenge: Rhetorical Role Labeling (RRL) of legal judgments presents challenges such as inferring sentence roles from context, interrelated roles, limited annotated data, and label imbalance.
Approach: They propose techniques to enhance RRL performance by leveraging knowledge from semantically similar instances.
Outcome: The proposed methods achieve remarkable improvements in challenging macro-F1 scores.
BIG5-CHAT: Shaping LLM Personalities Through Training on Human-Grounded Data (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for embedding human personality traits into LLMs are limited by realism and validity issues.
Approach: They propose to use a large-scale dataset to embed human personality traits into LLMs . they use supervised fine-tuning and direct preference optimization to train LLM models .
Outcome: The proposed methods outperform prompting on personality assessments and IPIP-NEO, and show higher conscientiousness, agreeableness, lower extraversion, and lower neuroticism on reasoning tasks.
Retrieval-Augmented Fine-Tuning With Preference Optimization For Visual Program Generation (2025.acl-long)

Copied to clipboard

Challenge: Visual programming languages (VPLs) allow users to create programs through graphical interfaces, which results in easier accessibility and widespread usage in various domains.
Approach: They propose to train VPLs from user instructions using large language models . they propose to use retrieval-augmented fine-tuning to leverage repetitive use of subroutines .
Outcome: The proposed method outperforms prompting-based methods for LD generation accuracy even with smaller backbone models.
CoViPAL: Layer-wise Contextualized Visual Token Pruning for Large Vision-Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to prune redundant vision tokens struggle in shallow layers due to the lack of contextual information.
Approach: They propose a layer-wise contextualized visual token pruning method that uses a plug-and-play Pruning Module to prune redundant vision tokens.
Outcome: The proposed method outperforms training-free pruning methods under equal token budgets and surpasses training based methods with comparable supervision.
Speed Up Your Code: Progressive Code Acceleration Through Bidirectional Tree Editing (2025.acl-long)

Copied to clipboard

Challenge: Existing training methods, such as direct instruction fine-tuning, overlook hierarchical relationships among acceleration patterns.
Approach: They propose a new training paradigm that uses bidirectional tree editing and progressive code acceleration learning to improve LLMs’ CA capabilities.
Outcome: The proposed training paradigm outperforms prompt-enhanced GPT-4 and current training-based methods on average across five programming languages.
Coarse-to-Fine Multimodal Information Selection for Video Speaking Style Recognition with Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Video speaking style recognition (VSSR) aims to classify conversations into different types . integrating all multimodal data yields suboptimal results, authors say .
Approach: They propose a framework that allows users to obtain multimodal data via coarse-to-fine selection . they propose to use visual captions and textual dialogues to integrate multimodal information .
Outcome: The proposed framework outperforms existing training-free approaches and most training-based methods on multiple datasets.
UNCLE: Benchmarking Uncertainty Expressions in Long-Form Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing work lacks direct and fair evaluation of Large Language Models’ ability to express uncertainty effectively in long-form generation.
Approach: They propose a benchmark to evaluate uncertainty expression in both long- and short-form question answering (QA) they propose prompt-based and training-based methods to improve models’ performance.
Outcome: The proposed method mitigates this issue but a misalignment persists in uncertainty expression between long- and short-form generation.
Personalized Language Models via Privacy-Preserving Evolutionary Model Merging (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for personalization in language models lack explicit mechanisms for privacy preservation.
Approach: They propose a Privacy-Preserving Model Merging via Evolutionary Algorithms to optimize utility while minimizing privacy risks.
Outcome: The proposed approach outperforms baseline models on the LaMP benchmark and achieves 45% improvement in task performance.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations